A boolean algebraic approach to semiproper iterations

نویسنده

  • Matteo Viale
چکیده

These notes present a compact and self contained development of the theory of iterated forcing with a focus on semiproperness and revised countable support iterations. We shall pursue the approach to iterated forcing devised by Donder and Fuchs in [4], thus we shall present iterated forcing by means of directed system of complete and injective homomorphisms of complete boolean algebras. A guiding idea that drives this work is that for many purposes, especially when dealing with problems of a methamatematical nature, the use of boolean valued models is more convenient. A partial order and its boolean completion can produce exactly the same consistency results, however:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iteration of Semiproper Forcing Revisited

We present a method for iterating semiproper forcing which uses side conditions and is inspired by the technique recently introduced by Nee-

متن کامل

Constructing $2m$-variable Boolean functions with optimal algebraic immunity based on polar decomposition of $\mathbb{F}_{2^{2m}}^*$

Constructing 2m-variable Boolean functions with optimal algebraic immunity based on decomposition of additive group of the finite field F22m seems to be a promising approach since Tu and Deng’s work. In this paper, we consider the same problem in a new way. Based on polar decomposition of the multiplicative group of F22m , we propose a new construction of Boolean functions with optimal algebrai...

متن کامل

On some classes of expansions of ideals in $MV$-algebras

In this paper, we introduce the notions of expansion of ideals in $MV$-algebras, $ (tau,sigma)- $primary, $ (tau,sigma)$-obstinate  and $ (tau,sigma)$-Boolean  in $ MV- $algebras. We investigate the relations of them. For example, we show that every $ (tau,sigma)$-obstinate ideal of an $ MV-$ algebra is $ (tau,sigma)$-primary  and $ (tau,sigma)$-Boolean. In particular, we define an expansion $ ...

متن کامل

On Boolean Control Networks -- an Algebraic Approach

Boolean network is a powerful tool in describing the genetic regulatory networks. Accompanying the development of systems biology, the analysis and control of Boolean networks have attracted much attention from biologists, physicists, and systems scientists. This paper surveys a series of recent results on Boolean (control) networks, obtained by the algebraic approach proposed by the authors. F...

متن کامل

Tensor Transform of Boolean Functions and Related Algebraic and Probabilistic Properties

We introduce a tensor transform for Boolean functions that covers the algebraic normal and Walsh transforms but which also allows for the definition of new, probabilistic and weight transforms, relating a function to its bias polynomial and to the weights of its subfunctions respectively. Our approach leads to easy proofs for some known results and to new properties of the aforecited transforms...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014